perm filename 154EX[1,RWF] blob sn#746007 filedate 1984-03-02 generic text, type C, neo UTF8
COMMENT āŠ—   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	CS154 Exercise:
C00003 ENDMK
CāŠ—;
CS154 Exercise:

Show that any two-counter machine is expressible as the composition of two
non-deterministic one-counter machines.  If it seems obvious or easy, you
don't understand the problem.

Show that anything that can be done by composition can be done by filters
with the same devices, plus one total FSM.